A box-covering algorithm for fractal scaling in scale-free networks
نویسندگان
چکیده
منابع مشابه
A box-covering algorithm for fractal scaling in scale-free networks.
A random sequential box-covering algorithm recently introduced to measure the fractal dimension in scale-free (SF) networks is investigated. The algorithm contains Monte Carlo sequential steps of choosing the position of the center of each box; thereby, vertices in preassigned boxes can divide subsequent boxes into more than one piece, but divided boxes are counted once. We find that such box-s...
متن کاملBox-covering algorithm for fractal dimension of weighted networks.
Box-covering algorithm is a widely used method to measure the fractal dimension of complex networks. Existing researches mainly deal with the fractal dimension of unweighted networks. Here, the classical box covering algorithm is modified to deal with the fractal dimension of weighted networks. Box size length is obtained by accumulating the distance between two nodes connected directly and gra...
متن کاملBox-covering algorithm for fractal dimension of complex networks.
The self-similarity of complex networks is typically investigated through computational algorithms, the primary task of which is to cover the structure with a minimal number of boxes. Here we introduce a box-covering algorithm that outperforms previous ones in most cases. For the two benchmark cases tested, namely, the E. coli and the World Wide Web (WWW) networks, our results show that the imp...
متن کاملOptimal box-covering algorithm for fractal dimension of complex networks
Christian M. Schneider, 2, ∗ Tobias A. Kesselring, José S. Andrade Jr., and Hans J. Herrmann 3 Computational Physics, IfB, ETH Zurich, Schafmattstrasse 6, 8093 Zurich, Switzerland Department of Civil and Environmental Engineering, MIT, 77 Massachusetts Avenue, Cambridge, MA 02139, USA Departamento de F́ısica, Universidade Federal do Ceará, 60451-970 Fortaleza, Ceará, Brazil (Dated: February 25, ...
متن کاملScale-free networks embedded in fractal space
The impact of an inhomogeneous arrangement of nodes in space on a network organization cannot be neglected in most real-world scale-free networks. Here we propose a model for a geographical network with nodes embedded in a fractal space in which we can tune the network heterogeneity by varying the strength of the spatial embedding. When the nodes in such networks have power-law distributed intr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos: An Interdisciplinary Journal of Nonlinear Science
سال: 2007
ISSN: 1054-1500,1089-7682
DOI: 10.1063/1.2737827